Controlling Risk Exposure in Periodic Environments: A Genetic Algorithm Approach
نویسنده
چکیده
In this paper, we compare the performance of different agent’s investment strategies in an investment scenario with periodic returns and different types and levels of noise. We consider an investment model, where an agent decides the percentage of budget to risk at each time step. Afterwards, agent’s investment is evaluated in the market via a return on investment (RoI), which we assume is a stochastic process with unknown periodicities and different levels of noise. To control the risk exposure, we investigate approaches based on: technical analysis (Moving Least Squares, MLS), and evolutionary computation (Genetic Algorithms, GA). In our comparison, we also consider two reference strategies for zero-knowledge and complete-knowledge behaviors, respectively. In our approach, the performance of a strategy corresponds to the average budget that can be obtained with this strategy over a certain number of time steps. To this end, we perform some computer experiments, where for each strategy the budget obtained after a certain number of time steps is averaged over a large number of trials. To make the comparison fair, we first tune the parameters of each strategy. Afterwards, we compare the performance of these strategies for RoIs with different levels of noise and different periodicities.
منابع مشابه
Monitoring process variability: a hybrid Taguchi loss and multiobjective genetic algorithm approach
The common consideration on economic model is that there is knowledge about the risk of occurrence of an assignable cause and the various cost parameters that does not always adequately describe what happens in practice. Hence, there is a need for more realistic assumptions to be incorporated. In order to reduce cost penalties for not knowing the true values of some parameters, this paper aims ...
متن کاملA genetic algorithm approach for a dynamic cell formation problem considering machine breakdown and buffer storage
Cell formation problem mainly address how machines should be grouped and parts be processed in cells. In dynamic environments, product mix and demand change in each period of the planning horizon. Incorporating such assumption in the model increases flexibility of the system to meet customer’s requirements. In this model, to ensure the reliability of the system in presence of unreliable machine...
متن کاملa swift heuristic algorithm base on data mining approach for the Periodic Vehicle Routing Problem: data mining approach
periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. This paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (PVRP). The related results of proposed algorithm are compared with the resu...
متن کاملA New Hybrid Routing Algorithm based on Genetic Algorithm and Simulated Annealing for Vehicular Ad hoc Networks
In recent years, Vehicular Ad-hoc Networks (VANET) as an emerging technology have tried to reduce road damage and car accidents through intelligent traffic controlling. In these networks, the rapid movement of vehicles, topology dynamics, and the limitations of network resources engender critical challenges in the routing process. Therefore, providing a stable and reliable routing algorithm is ...
متن کاملA New Approach to Software Cost Estimation by Improving Genetic Algorithm with Bat Algorithm
Because of the low accuracy of estimation and uncertainty of the techniques used in the past to Software Cost Estimation (SCE), software producers face a high risk in practice with regards to software projects and they often fail in such projects. Thus, SCE as a complex issue in software engineering requires new solutions, and researchers make an effort to make use of Meta-heuristic algorithms ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0709.4464 شماره
صفحات -
تاریخ انتشار 2007